منابع مشابه
On a Combinatorial Game
A drawing strategy is explained which applies to a wide class of combinatorial and positional games. In some settings the strategy is best possible. When applied to n-dimensional Tic-Tac-Toe, it improves a result of Hales and Jewett [5]. A family of sets {A k i is said to have property B if there is a set S which meets every A k and contains none of them. m(n) is the smallest integer so that th...
متن کاملTron, a Combinatorial Game on Abstract Graphs
We study the combinatorial two-player game Tron. We answer the extremal question on general graphs and also consider smaller graph classes. Bodlaender and Kloks conjectured in [2] PSPACEcompleteness. We proof this conjecture.
متن کاملNotes on the combinatorial game: graph Nim
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama. In this paper, we focus on the version of Nim played on graphs which was introduced by N.J. Calkin et al.: Two players alternate turns, each time choosing a vertex v of a finite graph and removing any number ...
متن کاملCombinatorial Game Theory
Known complexity facts: the decision problem of the existence of a kernel in a digraph G = (V; E) is NP-complete; if all of the cycles of G have even length, then G has a kernel; and the question of the number of kernels is #P-complete even for this restricted class of digraphs. In the opposite direction, we construct game theory tools, of independent interest, concerning strategies in the pres...
متن کاملThe Combinatorial Naming Game
In this article we introduce combinatorial form into the well-known Naming Game paradigm in which autonomous agents have to establish a globally shared communication system through strictly local interactions. While virtually all investigations of the Naming Game so far have been carried out using atomic names, we highlight some interesting aspects that arise only when naming is done using comb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1973
ISSN: 0097-3165
DOI: 10.1016/0097-3165(73)90005-8